Lossy Source Coding - Information Theory, IEEE Transactions on

نویسندگان

  • Toby Berger
  • Jerry D. Gibson
چکیده

Lossy coding of speech, high-quality audio, still images, and video is commonplace today. However, in 1948, few lossy compression systems were in service. Shannon introduced and developed the theory of source coding with a fidelity criterion, also called rate-distortion theory. For the first 25 years of its existence, rate-distortion theory had relatively little impact on the methods and systems actually used to compress real sources. Today, however, rate-distortion theoretic concepts are an important component of many lossy compression techniques and standards. We chronicle the development of rate-distortion theory and provide an overview of its influence on the practice of lossy source coding.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal coding of nonstationary sources

In this correspondence we investigate the performance of the Lempel–Ziv incremental parsing scheme on nonstationary sources. We show that it achieves the best rate achievable by a finite-state block coder for the nonstationary source. We also show a similar result for a lossy coding scheme given by Yang and Kieffer which uses a Lempel–Ziv scheme to perform lossy coding.

متن کامل

A coding theorem for lossy data compression by LDPC codes

In this correspondence, low-density parity-check (LDPC) codes are applied to lossy source coding and we study how the asymptotic performance of MacKay’s LDPC codes depends on the sparsity of the parity-check matrices in the source coding of the binary independent and identically distributed (i.i.d.) source with Pr = 1 = 0 5. In the sequel, it is shown that an LDPC code with column weight (log )...

متن کامل

Critical behavior in lossy source coding

The following critical phenomenon was recently discovered. When a memoryless source is compressed using a variable-length fixed-distortion code, the fastest convergence rate of the (pointwise) compression ratio to R(D) is either O( √ n) or O(logn). We show it is always O( √ n), except for discrete, uniformly distributed sources. Keywords—Redundancy, rate-distortion theory, lossy data compression

متن کامل

Pointwise redundancy in lossy data compression and universal lossy data compression

We characterize the achievable pointwise redundancy rates for lossy data compression at a fixed distortion level. “Pointwise redundancy” refers to the difference between the description length achieved by an nth-order block code and the optimal nR(D) bits. For memoryless sources, we show that the best achievable redundancy rate is of order O( √ n) in probability. This follows from a second-orde...

متن کامل

Fixed-rate universal lossy source coding and rates of convergence for memoryless sources

AbstructA fixed-rate universal lossy coding scheme is introduced for independent and identically distributed (i.i.d.) sources. It is shown for finite alphabet sources and arbitrary single letter distortion measures that as the sample size T I grows the expected distortion obtained using this universal scheme converges to Shannon’s distortion rate function D ( R ) at a rate 0 (log , I / , , ) . ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998